Stone duality for first order logic
نویسندگان
چکیده
منابع مشابه
Stone duality for first-order logic: a nominal approach to logic and topology
What are variables, and what is universal quantification over a variable? Nominal sets are a notion of ‘sets with names’, and using equational axioms in nominal algebra these names can be given substitution and quantification actions. So we can axiomatise first-order logic as a nominal logical theory. We can then seek a nominal sets representation theorem in which predicates are interpreted as ...
متن کاملCoalgebras, Stone Duality, Modal Logic
A brief outline of the topics of the course could be as follows. Coalgebras generalise transition systems. Modal logics are the natural logics for coalgebras. Stone duality provides the relationship between coalgebras and modal logic. Furthermore, some basic category theory is needed to understand coalgebras as well as Stone duality. So we will need to learn something about modal logic, about S...
متن کاملFirst-order logical duality
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models. The situation can be cast as a formal duality relating two categ...
متن کاملSTONE DUALITY FOR R0-ALGEBRAS WITH INTERNAL STATES
$Rsb{0}$-algebras, which were proved to be equivalent to Esteva and Godo's NM-algebras modelled by Fodor's nilpotent minimum t-norm, are the equivalent algebraic semantics of the left-continuous t-norm based fuzzy logic firstly introduced by Guo-jun Wang in the mid 1990s.In this paper, we first establish a Stone duality for the category of MV-skeletons of $Rsb{0}$-algebras and the category of t...
متن کاملGeometric and Higher Order Logic in terms of Abstract Stone Duality
The contravariant powerset, and its generalisations Σ to the lattices of open subsets of a locally compact topological space and of recursively enumerable subsets of numbers, satisfy the Euclidean principle that φ ∧ F (φ) = φ ∧ F (>). Conversely, when the adjunction Σ(−) a Σ(−) is monadic, this equation implies that Σ classifies some class of monos, and the Frobenius law ∃x.(φ(x) ∧ ψ) = (∃x.φ(x...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1987
ISSN: 0001-8708
DOI: 10.1016/0001-8708(87)90020-x